GASP: Guitars with ambisonic spatial performance

‘Guitars with Ambisonic Spatial Performance’ (GASP) is an ongoing project where our expertise in surround sound algorithmic research is combined with off-the-shelf hardware and bespoke software to create a spatial multichannel surround guitar performance system. This poster was funded through the ‘Undergraduate Research Scholarship Scheme’ (URSS) and presented at the University of Derby Buxton Campus 10th Annual Learning & Teaching conference on Wednesday 1st July 2015. The theme being ‘Students as Partners: Linking Teaching, Research and Enterprise’. The poster was also utilised as a contribution to the Creative Technologies Research Group (CTRG) ‘Sounds in Space’ symposium held at the University of Derby in June 2015, at which three pieces of multichannel guitar recordings were demonstrated.‘Undergraduate Research Scholarship Scheme’ (URSS) University of Derb

Hadron Fragmentation Inside Jets in Hadronic Collisions

We present an analytical next-to-leading order QCD calculation of the partonic cross sections for the process $pp\rightarrow ({\text{jet}} \,h)X$, for which a specific hadron is observed inside a fully reconstructed jet. In order to obtain the analytical results, we assume the jet to be relatively narrow. We show that the results can be cast into a simple and systematic form based on suitable universal jet functions for the process. We confirm the validity of our calculation by comparing to previous results in the literature for which the next-to-leading order cross section was treated entirely numerically by Monte-Carlo integration techniques. We present phenomenological results for experiments at the LHC and at RHIC. These suggest that $pp\rightarrow ({\text{jet}} \,h)X$ should enable very sensitive probes of fragmentation functions, especially of the one for gluons.Comment: 27 pages, 9 figures. Some additions and new comparisons to data. Version to appear in Physical Review

The complex step method for approximating the Fréchet derivative of matrix functions in automorphism groups

We show, that the Complex Step approximation to the Fréchet derivative of matrix functions is applicable to the matrix sign, square root and polar mapping using iterative schemes. While this property was already discovered for the matrix sign using Newtons method, we extend the research to the family of Padé iterations, that allows us to introduce iterative schemes for finding function and derivative values while approximately preserving automorphism group structure

Ontology-assisted database integration to support natural language processing and biomedical data-mining

Successful biomedical data mining and information extraction require a complete picture of biological phenomena such as genes, biological processes, and diseases; as these exist on different levels of granularity. To realize this goal, several freely available heterogeneous databases as well as proprietary structured datasets have to be integrated into a single global customizable scheme. We will present a tool to integrate different biological data sources by mapping them to a proprietary biomedical ontology that has been developed for the purposes of making computers understand medical natural language

Dancing Honeymoon

https://digitalcommons.library.umaine.edu/mmb-vp/1267/thumbnail.jp

A Fast Algorithm for Simulating the Chordal Schramm-Loewner Evolution

The Schramm-Loewner evolution (SLE) can be simulated by dividing the time interval into N subintervals and approximating the random conformal map of the SLE by the composition of N random, but relatively simple, conformal maps. In the usual implementation the time required to compute a single point on the SLE curve is O(N). We give an algorithm for which the time to compute a single point is O(N^p) with p<1. Simulations with kappa=8/3 and kappa=6 both give a value of p of approximately 0.4.Comment: 17 pages, 10 figures. Version 2 revisions: added a paragraph to introduction, added 5 references and corrected a few typo

Scaling and regeneration of self-organized patterns

Biological patterns generated during development and regeneration often scale with organism size. Some organisms, e.g., flatworms, can regenerate a rescaled body plan from tissue fragments of varying sizes. Inspired by these examples, we introduce a generalization of Turing patterns that is self-organized and self-scaling. A feedback loop involving diffusing expander molecules regulates the reaction rates of a Turing system, thereby adjusting pattern length scales proportional to system size. Our model captures essential features of body plan regeneration in flatworms as observed in experiments.Comment: 5 pages, 3 color figure

Next-to-leading Order Calculation for Jets Defined by a Maximized Jet Function

We present a next-to-leading order QCD calculation for the single-inclusive production of collimated jets at hadron colliders, when the jet is defined by maximizing a suitable jet function that depends on the momenta of final-state particles in the event. A jet algorithm of this type was initially proposed by Georgi and subsequently further developed into the class of "$J_{E_T}$ algorithms". Our calculation establishes the infrared safety of the algorithms at this perturbative order. We derive analytical results for the relevant partonic cross sections. We discuss similarities and differences with respect to jets defined by cone or (anti-)$k_t$ algorithms and present numerical results for the Tevatron and the LHC.Comment: 12 pages, 4 figures. Reference and two figures added; version to appear in Phys. Rev.